A new deterministic parallel sorting algorithm with an experimental evaluation
نویسندگان
چکیده
منابع مشابه
A New Deterministic Parallel Sorting Algorithm with and Experimental Evaluation
We introduce a new deterministic parallel sorting algorithm for distributed memory machines based on the regular sampling approach. The algorithm uses only two rounds of regular all-toall personalized communication in a scheme that yields very good load balancing with virtually no overhead. Moreover, unlike previous variations, our algorithm efficiently handles the presence of duplicate values ...
متن کاملA Randomized Parallel Sorting Algorithm with an Experimental Study
Previous schemes for sorting on general-purpose parallel machines have had to choose between poor load balancing and irregular communication or multiple rounds of all-to-all personalized communication. In this paper, we introduce a novel variation on sample sort which uses only two rounds of regular all-to-all personalized communication in a scheme that yields very good load balancing with virt...
متن کاملImproved Deterministic Parallel Padded Sorting
Given an input array of n real numbers, sorting with padding consists in writing those numbers in order in an array of size (1 +)n, thus leaving n entries empty. Only comparisons are allowed between the numbers to be sorted. We describe an algorithm that, with nk processors in the CRCW PRAM model, sorts the input array with padding o(1) using time O(log k n log (log k n) + loglog k). This impro...
متن کاملa new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot
abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...
15 صفحه اولAn Optimal Parallel Algorithm for Sorting Multisets
We consider the problem of sorting n numbers that contain only k distinct values. We present a randomized arbitrary CRCW PRAM algorithm that runs in O(logn) time using n log k logn processors. The same algorithm runs in O ( logn log logn ) time with a total work of O(n(log k) ) for any fixed > 0. All the stated bounds hold with high probability.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Journal of Experimental Algorithmics
سال: 1998
ISSN: 1084-6654,1084-6654
DOI: 10.1145/297096.297128